Application of symbol avoidance in Reed-Solomon codes to improve their synchronization

نویسندگان

  • Thokozani Shongwe
  • A. J. Han Vinck
  • Hendrik C. Ferreira
چکیده

In our previous work we introduced a method for avoiding/excluding some symbols in Reed-Solomon (RS) codes, called symbol avoidance. In this paper, we apply the symbol avoidance method to make synchronization of RS encoded data more effective. We avoid symbols in a RS code and then perform conventional frame synchronization on RS encoded data by appending sync-words on the data. The symbols in the RS code are avoided according to the sync-word used, such that the sync-word has very low probability of being found in the RS codewords, where it was not inserted. Therefore, for different sync-words, different symbols need to be avoided in the RS code. The goal here is to reduce the probability of mistaking data for the sync-word in the RS encoded framed data. Hence, the probability of successful synchronization is improved. Not only does our symbol avoidance code improve probability of successful synchronization, it also reduces the overall amount of redundancy required when the channel is very noisy.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A general construction of Reed-Solomon codes based on generalized discrete Fourier transform

In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes  enjoy nice algebraic properties just as the classic one.

متن کامل

Exploiting the cannibalistic traits of Reed-Solomon codes

In Reed-Solomon codes and all other maximum distance separable codes, there is an intrinsic relationship between the size of the symbols in a codeword and the length of the codeword. Increasing the number of symbols in a codeword to improve the efficiency of the coding system thus requires using a larger set of symbols. However, long Reed-Solomon codes are difficult to implement and many commun...

متن کامل

Algebraic techniques in designing quantum synchronizable codes

Quantum synchronizable codes are quantum error-correcting codes that can correct the effects of quantum noise as well as block synchronization errors. We improve the previously known general framework for designing quantum synchronizable codes through more extensive use of the theory of finite fields. This makes it possible to widen the range of tolerable magnitude of block synchronization erro...

متن کامل

RFC 5510 Reed - Solomon Forward Error Correction April

This document describes a Fully-Specified Forward Error Correction (FEC) Scheme for the Reed-Solomon FEC codes over GF(2^^m), where m is in {2..16}, and its application to the reliable delivery of data objects on the packet erasure channel (i.e., a communication path where packets are either received without any corruption or discarded during transmission). This document also describes a Fully-...

متن کامل

On Communication Over Channels With Varying Sampling Rate

We survey some of our recent results on communication over channels with varying sampling rate. Varying sampling rate is caused by inadequate timing recovery and can result in a synchronization error, exhibited as a repetition or a deletion of a symbol. We review number-theoretic constructions and the upper bounds of sets of strings capable of overcoming certain number of synchronization errors...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Telecommunication Systems

دوره 63  شماره 

صفحات  -

تاریخ انتشار 2016